Non-Archimedean Ergodic Theory and Pseudorandom Generators

نویسنده

  • Vladimir Anashin
چکیده

The paper develops techniques in order to construct computer programs, pseudorandom number generators (PRNG), that produce uniformly distributed sequences. The paper exploits an approach that treats standard processor instructions (arithmetic and bitwise logical ones) as continuous functions on the space of 2-adic integers. Within this approach, a PRNG is considered as a dynamical system and is studied by means of the non-Archimedean ergodic theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamics of non-archimedean Polish groups

A topological group G is Polish if its topology admits a compatible separable complete metric. Such a group is non-archimedean if it has a basis at the identity that consists of open subgroups. This class of Polish groups includes the profinite groups and (Qp, +) but our main interest here will be on non-locally compact groups. In recent years there has been considerable activity in the study o...

متن کامل

Pseudorandom Number Generators Based on Chaotic Dynamical Systems

Pseudorandom number generators are used in many areas of contemporary technology such as modern communication systems and engineering applications. In recent years a new approach to secure transmission of information based on the application of the theory of chaotic dynamical systems has been developed. In this paper we present a method of generating pseudorandom numbers applying discrete chaot...

متن کامل

The Non-Archimedean Theory of Discrete Systems

In the paper, we study behaviour of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behaviour of the system w.r.t. variety of word transformations performed by the system: We call a system completely transitive if, given arbitrary pair a, b of finite words that have equal lengths, the system A, while evolution during (discrete...

متن کامل

On Generators in Archimedean Copulas

This study after reviewing  construction methods of generators in Archimedean copulas (AC),  proposes several useful lemmas related with generators of AC. Then a new trigonometric Archimedean family will be shown which is based on cotangent function. The generated new family is able to model the low dependence structures.

متن کامل

Pseudorandom number generation by p-adic ergodic transformations: an addendum

The paper study counter-dependent pseudorandom number generators based on m-variate (m > 1) ergodic mappings of the space of 2-adic integers Z2. The sequence of internal states of these generators is defined by the recurrence law xi+1 = H B i (xi) mod 2 n, whereas their output sequence is zi = F B i (xi) mod 2 n; here xj , zj are m-dimensional vectors over Z2. It is shown how the results obtain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. J.

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2010